Automatic Differentiation Equipped Variable Elimination for Sensitivity Analysis on Probabilistic Inference Queries

ثبت نشده
چکیده

Probabilistic Models are a natural framework for describing the stochastic relation1 ships between variables in a system to perform inference tasks, such as estimating 2 the probability of a specific set of conditions or events. In application it is often 3 appropriate to perform sensitivity analysis on a model, for example, to assess the 4 stability of analytical results with respect to the governing parameters. However, 5 typical programming language are cumbersome for encoding and reasoning with 6 complex models and current approaches to sensitivity analysis on probabilistic 7 models are not scalable, as they require repeated computation or estimation of the 8 derivatives of complex functions. To overcome these limitations, and to enable effi9 cient sensitivity analysis with respect to arbitrary model queries, e.g., P (X|Y = y), 10 we propose to use Automatic Differentiation to extend the Probabilistic Program11 ming Language Figaro. 12

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lifted Variable Elimination for Probabilistic Logic Programming

Lifted inference has been proposed for various probabilistic logical frameworks in order to compute the probability of queries in a time that depends on the size of the domains of the random variables rather than the number of instances. Even if various authors have underlined its importance for probabilistic logic programming (PLP), lifted inference has been applied up to now only to relationa...

متن کامل

Counting and Conjunctive Queries in the Lifted Junction Tree Algorithm

Standard approaches for inference in probabilistic formalisms with first-order constructs include lifted variable elimination (LVE) for single queries. To handle multiple queries efficiently, the lifted junction tree algorithm (LJT) uses a first-order cluster representation of a knowledge base and LVE in its computations. We extend LJT with a full formal specification of its algorithm steps inc...

متن کامل

Lifted Probabilistic Inference with Counting Formulas

Lifted inference algorithms exploit repeated structure in probabilistic models to answer queries efficiently. Previous work such as de Salvo Braz et al.’s first-order variable elimination (FOVE) has focused on the sharing of potentials across interchangeable random variables. In this paper, we also exploit interchangeability within individual potentials by introducing counting formulas, which i...

متن کامل

10 - 708 : Probabilistic Graphical Models 10 - 708 , Spring 2014 13 : Variational Inference : Loopy Belief Propagation

The problem of probabilistic inference concerns answering queries about conditional and marginal probabilities in graphical models. Consider two disjoint subsets E and F of the nodes in a graphical model G. A query regarding marginal distribution p(xF ) can be calculated by the marginalization operation ∑ G\F p(x). A query regarding conditional distribution p(xF |xE) can be calculated by p(xF |...

متن کامل

Symbolic Variable Elimination for Discrete and Continuous Graphical Models

Probabilistic reasoning in the real-world often requires inference in continuous variable graphical models, yet there are few methods for exact, closed-form inference when joint distributions are non-Gaussian. To address this inferential deficit, we introduce SVE – a symbolic extension of the well-known variable elimination algorithm to perform exact inference in an expressive class of mixed di...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017